Finding Good Column Orderings for Sparse QR Factorization
نویسندگان
چکیده
For sparse QR factorization, nding a good column ordering of the matrix to be factorized, is essential. Both the amount of ll in the resulting factors, and the number of oating-point operations required by the factorization, are highly dependent on this ordering. A suitable column ordering of the matrix A is usually obtained by minimum degree analysis on A T A. The objective of this analysis is to produce low ll in the resulting triangular factor R. We observe that the eeciency of sparse QR factorization is also dependent on other criteria, like the size and the structure of intermediate ll, and the size and the structure of the frontal matrices for the multifrontal method, in addition to the amount of ll in R. An important part of this information is lost when A T A is formed. However, the structural information from A is important to consider in order to nd good column orderings. We show how a suitable equivalent reordering of an initial ll-reducing ordering can decrease the number of operations required by multifrontal QR factorization, without increasing the number of nonzeros in R. Heuristics that produce good equivalent reorderings are proposed and explained. We also propose tie-breaking strategies for the minimum degree algorithm, which produce orderings that require considerably less number of operations in both multifrontal and traditional Householder QR factorization, than the standard minimum degree algorithm without tie-breaking.
منابع مشابه
Fill-in reduction in sparse matrix factorizations using hypergraphs
We discuss partitioning methods using hypergraphs to produce fill-reducing orderings of sparse matrices for Cholesky, LU and QR factorizations. For the Cholesky factorization, we investigate a recent result on pattern-wise decomposition of sparse matrices, generalize the result, and develop algorithmic tools to obtain more effective ordering methods. The generalized results help us to develop f...
متن کاملMIQR: A Multilevel Incomplete QR Preconditioner for Large Sparse Least-Squares Problems
This paper describes a Multilevel Incomplete QR (MIQR) factorization for solving large sparse least-squares problems. The algorithm builds the factorization by exploiting structural orthogonality in general sparse matrices. At any given step, the algorithm finds an independent set of columns, i.e., a set of columns that have orthogonal patterns. The other columns are then block orthogonalized a...
متن کاملMathematics and Engineering Analysis Technical Report Boeing Information and Support Services Mea-tr-193-revised Sparse Multifrontal Rank Revealing Qr Factorization Sparse Multifrontal Rank Revealing Qr Factorization
We describe an algorithm to compute a rank revealing sparse QR factorization. We augment a basic sparse multifrontal QR factoriza-tion with an incremental condition estimator to provide an estimate of the least singular value and vector for each successive column of R. We remove a column from R as soon as the condition estimate exceeds a tolerance, using the approximate singular vector to selec...
متن کاملMultifrontral multithreaded rank-revealing sparse QR factorization
SuiteSparseQR is a sparse multifrontal QR factorization algorithm. Dense matrix methods within each frontal matrix enable the method to obtain high performance on multicore architectures. Parallelism across different frontal matrices is handled with Intel’s Threading Building Blocks library. Rank-detection is performed within each frontal matrix using Heath’s method, which does not require colu...
متن کاملReducing the ll-in size for an elimination tree
In sparse Cholesky factorization, nding elimination orderings that produce small ll-in is very important and various heuristics have been proposed. For parallel computations, good orderings should produce elimination trees of low height. Finding optimal ll-in orderings and nding optimal height orderings are NP-hard problems. A class of Nested Dissection orderings with minimal separators, has be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996